A sluggish random walk with subdiffusive spread
نویسندگان
چکیده
We study a one-dimensional sluggish random walk with space-dependent transition probabilities between nearest-neighbour lattice sites. Motivated by trap models of slow dynamics, we consider model in which the depth increases logarithmically distance from origin. This leads to has symmetric that decrease $|k|$ origin as $1/|k|$ for large $|k|$. show typical position after time $t$ scales $t^{1/3}$ nontrivial scaling function distribution trough (a cusp singularity) at Therefore an effective central bias away emerges even though are symmetric. also compute survival probability walker presence sink and it decays $t^{-1/3}$ late times. Furthermore maximum position, $M(t)$, right up $t$, function. Finally provide generalisation this where decay $1/|k|^\alpha$ $\alpha >0$.
منابع مشابه
A Random Walk with Exponential Travel Times
Consider the random walk among N places with N(N - 1)/2 transports. We attach an exponential random variable Xij to each transport between places Pi and Pj and take these random variables mutually independent. If transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...
متن کاملA subdiffusive behaviour of recurrent random walk in random environment on a regular tree
We are interested in the random walk in random environment on an infinite tree. Lyons and Pemantle [11] give a precise recurrence/transience criterion. Our paper focuses on the almost sure asymptotic behaviours of a recurrent random walk (Xn) in random environment on a regular tree, which is closely related to Mandelbrot [13]’s multiplicative cascade. We prove, under some general assumptions up...
متن کاملa random walk with exponential travel times
consider the random walk among n places with n(n - 1)/2 transports. we attach an exponential random variable xij to each transport between places pi and pj and take these random variables mutually independent. if transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...
متن کاملHow Fast Does a General Branching Random Walk Spread?
New results on the speed of spread of the one-dimensionalspatial branching process are described. Generalizations to the multitype case and to d dimensions are discussed. The relationship of the results with deterministic theory is also indicated. Finally the theory developed is used to reprove smoothly (and improve slightly) results on certain data-storage algorithms arising in computer science.
متن کاملFractional brownian motion versus the continuous-time random walk: a simple test for subdiffusive dynamics.
Fractional Brownian motion with Hurst index less then 1/2 and continuous-time random walk with heavy tailed waiting times (and the corresponding fractional Fokker-Planck equation) are two different processes that lead to a subdiffusive behavior widespread in complex systems. We propose a simple test, based on the analysis of the so-called p variations, which allows distinguishing between the tw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Mechanics: Theory and Experiment
سال: 2023
ISSN: ['1742-5468']
DOI: https://doi.org/10.1088/1742-5468/acc4b1